The Awareness of cultural orientations in culturally responsive education for Korean American students

It is important for teachers to be aware of the cultural backgrounds of students and their family in order to provide culturally responsive instruction and counseling. Most teachers may identify Asian ethnicities due to their distinguishable physical or behavioral characteristics but they may not know how Asian Americans have changed their cultural value and legacies. To examine cultural orientation, the Korean American Acculturation Scale (KAAS), which consists of behavior and cultural value orientations, was administered to 466 Korean American students. The result indicated that the most recent generations were less behaviorally oriented to Korean culture and more disoriented to Korean cultural value after controlling the affect of age. However, the degree of behavior and cultural value disorientation to Korean culture varied among individual Korean American students, depending on their genders and/or generations. Korean American students seemed to choose the degree and mode of their cultural orientation selectively during their acculturation

BRST symmetries in SU(3) linear sigma model

We study the BRST symmetries in the SU(3) linear sigma model which is constructed through introduction of a novel matrix for the Goldstone boson fields satisfying geometrical constraints embedded in SU(2) subgroup. To treat these constraints we exploit the improved Dirac quantization scheme. We also discuss phenomenological aspacts in the mean field approach to this model.Comment: 17 pages, no figur

Ranking Functions for Size-Change Termination II

Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program in the form of "size-change graphs". We present algorithms that, for certain classes of size-change graphs, deduce a global ranking function: an expression that ranks program states, and decreases on every transition. A ranking function serves as a witness for a termination proof, and is therefore interesting for program certification. The particular form of the ranking expressions that represent SCT termination proofs sheds light on the scope of the proof method. The complexity of the expressions is also interesting, both practicaly and theoretically. While deducing ranking functions from size-change graphs has already been shown possible, the constructions in this paper are simpler and more transparent than previously known. They improve the upper bound on the size of the ranking expression from triply exponential down to singly exponential (for certain classes of instances). We claim that this result is, in some sense, optimal. To this end, we introduce a framework for lower bounds on the complexity of ranking expressions and prove exponential lower bounds.Comment: 29 pages